A Diameter Bound For

نویسندگان

  • Matthew E. White
  • MATTHEW E. WHITE
چکیده

By Margulis’ result, in our setting diameter and injectivty radius are inversely related. Thus, our theorem can also be viewed as a lower bound on injectivity radius; that is, with the above hypothesis, inj(M) > 1 R(l(P )) . It is known that that infinitely many closed, hyperbolic 3-manifolds of volume less than a given upper bound may be obtained by hyperbolic Dehn surgery on a finite list of compact manifolds. But only finitely many of these closed manifolds have diameter less than a given upper bound. Thus, our results provide a sharper version of Theorem 1.0. An outline of the proof is the following: we construct a straight 2-complex from a fundamental group presentation which maps into the manifold π1-isomorphically. Assuming the diameter of the mainifold is very large compared to the presentation length, Margulis provides us with a deep solid torus surrounding a short geodesic core. It turns out that the 2-complex cannot be homotoped to be disjoint from the solid torus. We consider the subcomplex that maps into the solid torus. From this subcomplex, we construct another 2-complex which simultaneously has a large torsion subgroup in first homology and a small triangulation. This is a contradiction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper bound and numerical analysis of cyclic expansion extrusion (CEE) process

Deformation of the material during cyclic expansion extrusion (CEE) is investigated using upper-bound theorem. The analytical approximation of forming loads agrees very well with the FEM results for different amounts of chamber diameter, friction factor and also for lower die angles. However, the difference between analytical and numerical solution increases at higher die angles which are expla...

متن کامل

A generalization of zero-divisor graphs

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores

متن کامل

On the harmonic index and harmonic polynomial of Caterpillars with diameter four

The harmonic index H(G) , of a graph G is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in E(G), where deg (u) denotes the degree of a vertex u in V(G). In this paper we define the harmonic polynomial of G. We present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in Caterpill...

متن کامل

On Harmonic Index and Diameter of Unicyclic Graphs

The Harmonic index $ H(G) $ of a graph $ G $ is defined as the sum of the weights $ dfrac{2}{d(u)+d(v)} $ of all edges $ uv $ of $G$, where $d(u)$ denotes the degree of the vertex $u$ in $G$. In this work, we prove the conjecture $dfrac{H(G)}{D(G)} geq dfrac{1}{2}+dfrac{1}{3(n-1)}  $ given by Jianxi Liu in 2013 when G is a unicyclic graph and give a better bound $ dfrac{H(G)}{D(G)}geq dfra...

متن کامل

Mechanical Properties of Irregular Fiber (Invited Review Paper)

Irregularities are inherent to virtually all fibers, including the conventional textile fibers, the high-performance brittle fibers and newly developed nano-fibers. These irregularities can fall into two main categories: dimensional or geometrical irregularity (external) and structural irregularity (internal). For natural fibers such as wool, diameter variation along fiber length is atypical ex...

متن کامل

Improvement of Kalai-Kleitman bound for the diameter of a polyhedron

Recently, Todd got a new bound on the diameter of a polyhedron using an analysis due to Kalai and Kleitman in 1992. In this short note, we prove that the bound by Todd can further be improved. Although our bound is not valid when the dimension is 1 or 2, it fits better for a high-dimensional polyhedron with a large number of facets. Keyword: Polytopes, Diameter, Kalai and Kleitman bound.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000